Clones on Regular Cardinals

We investigate the structure of the lattice of clones on an infinite set X . We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are 2 λ many maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a strong negative partition theorem from pcf theory we show that for many cardinals λ (in particular, for all successors of regulars) there are 2 λ many such clones on a set of size λ. Finally, we show that on a weakly compact cardinal there are exactly 2 precomplete clones which contain all unary functions.